A Layout Algorithm for Bar-Visibility Graphs on the Möbius Band
نویسنده
چکیده
We characterize two types of bar-visibility graphs on the Mobius band (abbreviated "BVGMs"), in which vertices correspond to intervals that are parallel or orthogonal to the axis of the band, depen ding on type, and in which adjacency corresponds to orthogonal visibility of intervals. BVGMs with intervals orthogonal to the axis are shown to be equivalent to the "polar visibility graphs" studied by Hutchinson [7]. BVGMs with intervals parallel to the axis are characterized as those graphs G which satisfy the following condi tions: G is embedded on the Mobius band; the block-cutpoint tree of G is a caterpillar in which all but at most one block is planar; and the non-planar block, if it exists, is at the "head" of the caterpillar.
منابع مشابه
Characterization of [1, k]-Bar Visibility Trees
A unit bar-visibility graph is a graph whose vertices can be represented in the plane by disjoint horizontal unit-length bars such that two vertices are adjacent if and only if there is a unobstructed, non-degenerate, vertical band of visibility between the corresponding bars. We generalize unit bar-visibility graphs to [1, k]bar-visibility graphs by allowing the lengths of the bars to be betwe...
متن کاملThickness of Bar 1-Visibility Graphs
Bar k-visibility graphs are graphs admitting a representation in which the vertices correspond to horizontal line segments, called bars, and the edges correspond to vertical lines of sight which can traverse up to k bars. These graphs were introduced by Dean et al. [3] who conjectured that bar 1-visibility graphs have thickness at most 2. We construct a bar 1-visibility graph having thickness 3...
متن کاملMore directions in visibility graphs
In this paper we introduce unit bar k-visibility graphs, which are bar kvisibility graphs in which every bar has unit length. We show that almost all families of unit bar k-visibility graphs and unit bar k-visibility graphs are incomparable under set inclusion. In addition, we establish the largest complete graph that is a unit bar k-visibility graph. As well, we present a family of hyperbox vi...
متن کاملParameters of Bar k-Visibility Graphs
Bar k-visibility graphs are graphs admitting a representation in which the vertices correspond to horizontal line segments, called bars, and the edges correspond to vertical lines of sight which can traverse up to k bars. These graphs were introduced by Dean et al. [4] who conjectured that bar 1-visibility graphs have thickness at most 2. We construct a bar 1-visibility graph having thickness 3...
متن کاملOn Visibility Graphs — Upper Bounds and Classification of Special Types
We examine several types of visibility graphs: bar and semi-bar k-visibility graphs, rectangle k-visibility graphs, arc and circle k-visibility graphs, and compact visibility graphs. We improve the upper bound on the thickness of bar k-visibility graphs from 2k(9k − 1) to 6k, and prove that the upper bound must be at least k + 1. We also show that the upper bound on the thickness of semi-bar k-...
متن کامل